#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 100010;
int n, m;
int q[N];

int main()
{
    scanf("%d %d", &n, &m);
    for (int i = 0; i < n; ++i) scanf("%d", &q[i]);

    for (int i = 0; i < m; ++i)
    {
        int x;
        scanf("%d", &x);

        int l = 0, r = n - 1;
        while (l < r)
        {
            int mid = (l + r) >> 1;
            if (q[mid] >= x) r = mid;
            else l = mid + 1;
        }

        if (q[l] == x)
        {
            printf("%d ", l);
            r = n - 1;
            while (l < r)
            {
                int mid = (l + r + 1) >> 1;
                if (q[mid] <= x) l = mid;
                else r = mid - 1;
            }
            if (q[r] == x)
            {
                printf("%d\n", r);
            }
        }
        else printf("-1 -1\n");
    }
    return 0;
}